An Adapted Non-Dominated Sorting Genetic Algorithm III (NSGA-III) with Repair-based operator for solving Controller Placement problem in Software-Defined Wide Area Networks

نویسندگان

چکیده

Optimum controller placement in the presence of several conflicting objectives has received significant attention Software-Defined Wide Area Network (SD-WAN) deployment. Multi-objective evolutionary algorithms, like Non-dominated Sorting Genetic Algorithm II (NSGA-II) and Particle Swamp Optimization (MOPSO), have proved helpful solving Controller Placement Problem (CPP) SD-WAN. However, these algorithms were associated with challenge scalability (when there are more than three objectives) for optimization Hence, this study proposed an adapted NSGA-III (A-NSGA-III) to resolve challenges NSGA-II MOPSO objectives. This developed introduced a repair-based operator into existing Mechanical Engineering based propose A-NSGA-III optimal The A-NSGA-III, subjected evaluation using datasets from Internet2 OS3E WAN topology six objective functions. Hypervolume indicator, Percentage Coefficient Variation (PCV), percentage difference Parallel Coordinate Plots (PCP) confirmed that exhibited high convergence diversification number function exceeded three). result solved was recommended over subject confirmation usage conditions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem

Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...

متن کامل

A method for identifying software components based on Non-dominated Sorting Genetic Algorithm

Identifying the appropriate software components in the software design phase is a vital task in the field of software engineering and is considered as an important way to increase the software maintenance capability. Nowadays, many methods for identifying components such as graph partitioning and clustering are presented, but most of these methods are based on expert opinion and have poor accur...

متن کامل

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

Multi-objective optimization of discrete time–cost tradeoff problem in project networks using non-dominated sorting genetic algorithm

The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate e...

متن کامل

Optimal Distribution System Reconfiguration Using Non-dominated Sorting Genetic Algorithm (NSGA-II)

In this paper, a Non-dominated Sorting Genetic Algorithm-II (NSGA-II) based approach is presented for distribution system reconfiguration. In contrast to the conventional GA based methods, the proposed approach does not require weighting factors for conversion of multi-objective function into an equivalent single objective function. In order to illustrate the performance of the proposed method,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE open journal of the Communications Society

سال: 2022

ISSN: ['2644-125X']

DOI: https://doi.org/10.1109/ojcoms.2022.3172551